Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems
نویسندگان
چکیده
منابع مشابه
A Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملhgels: a new hybrid algorithm based on gravitational force for solving multiple traveling salesman problems
multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...
متن کاملA Discrete State Transition Algorithm for Generalized Traveling Salesman Problem
Generalized traveling salesman problem (GTSP) is an extension of classical traveling salesman problem (TSP), which is a combinatorial optimization problem and an NP-hard problem. In this paper, an efficient discrete state transition algorithm (DSTA) for GTSP is proposed, where a new local search operator named K-circle, directed by neighborhood information in space, has been introduced to DSTA ...
متن کاملAnt Colony Optimization for dynamic Traveling Salesman Problems
This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live in colonies able to solve complex problems. The intelligence of the global society arises from self organization mechanisms, based on the indirect communication between individuals through pheromones. The routing problem...
متن کاملAn Improved Discrete Bat Algorithm for Symmetric and Asymmetric Traveling Salesman Problems
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2017
ISSN: 2261-236X
DOI: 10.1051/matecconf/201712802022